Countable Valued Fields in Weak Subsystems of Second-Order Arithmetic

نویسندگان

  • Kostas Hatzikiriakou
  • Stephen G. Simpson
چکیده

This paper is part of the program of reverse mathematics. We assume the reader is familiar with this program as well as with RCA,, and WKL,, the two weak subsystems of second-order arithmetic we are going to work with here. (If not, a good place to start is [2].) In [2], [3], [4], many well-known theorems about countable rings, countable fields, etc. were studied in the context of reverse mathematics. For example, in [2], it was shown that, over the weak base theory RC&, the statement that every countable commutative ring has a prime ideal is equivalent to weak Konig’s Lemma, i.e. the statement that every infinite (0, l} tree has a path. Our main result in this paper is that, over RC&, Weak Konig’s Lemma is equivalent to the theorem on extension of valuations for countable fields. The statement of this theorem is as follows: “Given a monomorphism of countable fields h : L+ K and a valuation ring R of L, there exists a valuation ring V of K such that h-‘(V) = R.” In [5], Smith produces a recursive valued field (F, R) with a recursive algebraic closure P such that R does not extend to a recursive valuation ring R of F. However, there is little or no overlap between the contents of the present paper and [5].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Proof-theoretic Strength of the Dushnik-miller Theorem for Countable Linear Orders

We show that the Dushnik-Miller Theorem for countable linear order-ings (stating that any countable linear ordering has a nontrivial self-embedding) is equivalent (over recursive comprehension (RCA 0)) to arithmetic comprehension (ACA 0). This paper presents a result in reverse mathematics, a program initiated by H. Friedman and S. Simpson, trying to determine the weakest possible \set-theoreti...

متن کامل

Extensions of Commutative Rings in Subsystems of Second Order Arithmetic

We prove that the existence of the integral closure of a countable commutative ring R in a countable commutative ring S is equivalent to Arithmetical Comprehension (over RCA0). We also show that i) the Lying Over ii) the Going Up theorem for integral extensions of countable commutative rings and iii) the Going Down theorem for integral extensions of countable domains R ⊂ S, with R normal, are p...

متن کامل

A review of Subsystems of Second Order Arithmetic

This is the first book to appear on “reverse mathematics”. The book provides an excellent introduction to the area and is packed with some interesting theorems and uses of mathematical logic. The theme of reverse mathematics is to take a theorem of mathematics and determine the set existence axioms needed to prove the chosen theorem. The goal is to show that the theorem is actually equivalent t...

متن کامل

Reverse mathematics: the playground of logic

The general enterprise of calibrating the strength of classical mathematical theorems in terms of the axioms (typically of set existence) needed to prove them was begun by Harvey Friedman in [1971] (see also [1967]). His goals were both philosophical and foundational. What existence assumptions are really needed to develop classical mathematics and what other axioms and methods suffice to carry...

متن کامل

Countable composition closedness and integer-valued continuous functions in pointfree topology

‎For any archimedean$f$-ring $A$ with unit in whichbreak$awedge‎ ‎(1-a)leq 0$ for all $ain A$‎, ‎the following are shown to be‎ ‎equivalent‎: ‎ ‎1‎. ‎$A$ is isomorphic to the $l$-ring ${mathfrak Z}L$ of all‎ ‎integer-valued continuous functions on some frame $L$‎. 2‎. ‎$A$ is a homomorphic image of the $l$-ring $C_{Bbb Z}(X)$‎ ‎of all integer-valued continuous functions‎, ‎in the usual se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 41  شماره 

صفحات  -

تاریخ انتشار 1989